An Overview of Rewrite Rule Laboratory (RRL)
نویسندگان
چکیده
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a full-edged theorem prover which has been used to solve hard and challenging mathematical problems in automated reasoning literature as well as a research tool for investigating the use of formal methods in hardware and software design. We provide a brief historical account of development of RRL and its descendants , give an overview of the main capabilities of RRL and conclude with a discussion of applications of RRL.
منابع مشابه
Mechanizing Verification of Arithmetic Circuits: SRT Division
The use of a rewrite-based theorem prover for verifying properties of arithmetic circuits is discussed. A prover such as Rewrite Rule Laboratory (RRL) can be used eeectively for establishing number-theoretic properties of adders, multipliers and dividers. Since veriication of adders and multipliers has been discussed elsewhere in earlier papers, the focus in this paper is on a divider circuit. ...
متن کاملVerification Tools in the Development of Provably Correct Compilers
The paper presents a practical veriication tool that helps in the development of provably correct compilers. The tool is based on the approach of proving termination of PROLOG-like programs using term-rewriting techniques and a technique of testing whether a given PROLOG program can be soundly executed on PROLOG interpreters without the Occur-check test. The tool has been built on top of the th...
متن کاملA Transformational Methodology for Proving Termination of Logic Programs
A methodology for proving the termination of well-moded logic programs is developed by reducing the termination problem of logic programs to that of term rewriting systems. A transformation procedure is presented to derive a term rewriting system from a given well-moded logic program such that the termination of the derived rewrite system implies the termination of the logic program for all wel...
متن کاملVademecum of Divergent Term Rewriting Systems
This paper presents two structural patterns to detect divergence of the completion procedure, followed by a detailed overview of diierent examples of divergent rewrite systems. Further it introduces ve different empirical methods to avoid divergence, applicable during a session with a rewrite rule laboratory.
متن کاملAutomating Proofs of Integrity Constraints in Situation Calculus
Automated support for proving integrity constraints (ICs) on deductive database update speciications is developed using an induction theorem prover, Rewrite Rule Laboratory (RRL) 6]. The approach proposed by Reiter 9, 11, 10] for solving the frame problem for such applications in a language of the situation calculus is used as a basic framework. Integrity constraints are propositions that are e...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1989